Cascadic Multigrid Methods for Parabolic Problems∗
نویسنده
چکیده
In this paper, we consider the cascadic multigrid method for a parabolic type equation. Backward Euler approximation in time and linear finite element approximation in space are employed. A stability result is established under some conditions on the smoother. Using new and sharper estimates for the smoothers that reflect the precise dependence on the time step and the spatial mesh parameter, these conditions are verified for a number of popular smoothers. Optimal error bounds are derived for both smooth and non-smooth data. Iteration strategies guaranteeing both the optimal accuracy and the optimal complexity are presented.
منابع مشابه
Cascadic Multigrid for Finite Volume Methods for Elliptic Problems ∗1)
In this paper, some effective cascadic multigrid methods are proposed for solving the large scale symmetric or nonsymmetric algebraic systems arising from the finite volume methods for second order elliptic problems. It is shown that these algorithms are optimal in both accuracy and computational complexity. Numerical experiments are reported to support our theory. Mathematics subject classific...
متن کاملCascadic Multigrid for Finite Volume Methods for Elliptic Problems
In this paper, some effective cascadic multigrid methods are proposed for solving the large scale symmetric or nonsymmetric algebraic systems arising from the finite volume methods for second order elliptic problems. It is shown that these algorithms are optimal in both accuracy and computational complexity. Numerical experiments are reported to support our theory.
متن کاملClassical and Cascadic Multigrid | a Methodical Comparison Classical and Cascadic Multigrid | a Methodical Comparison
Using the full multigrid method without any coarse grid correction steps but with an a posteriori control of the number of smoothing iterations was shown by Bornemann and Deuuhard 2] to be an optimal iteration method with respect to the energy norm. They named this new kind of multigrid iteration the cascadic multigrid method. However, numerical examples with linear nite elements raised serious...
متن کاملA Cascadic Multigrid Algorithm for Computing the Fiedler Vector of Graph Laplacians
In this paper, we develop a cascadic multigrid algorithm for fast computation of the Fiedler vector of a graph Laplacian, namely, the eigenvector corresponding to the second smallest eigenvalue. This vector has been found to have applications in fields such as graph partitioning and graph drawing. The algorithm is a purely algebraic approach based on a heavy edge coarsening scheme and pointwise...
متن کاملA cascadic multigrid algorithm for the Stokes equations
Multilevel methods without coarse grid corrections have been defined and applied to elliptic problems of second order by Bornemann and Deuflhard [1,5]. They have called it a cascadic algorithm and showed that an optimal iteration method with respect to the energy norm is obtained if conforming elements are used. Deuflhard’s starting point for the cascadic multigrid method [5] was the idea that ...
متن کامل